Yard template planning in transshipment hubs under uncertainty
نویسنده
چکیده
This paper is concerned with yard management in transshipment hubs, where a consignment strategy is often used to reduce reshuffling and vessel turnaround time. This strategy groups unloaded containers according to their destination vessels. In this strategy, yard template determines the assignment of the spaces (subblocks) in the yard to the vessels. This paper studies how to make a robust yard template under uncertain environment, e.g., uncertain arrival time and berthing positions of the arriving vessels. To reduce the potential traffic congestion of prime movers, the workload distribution of subblocks within the yard is considered. A mixed integer programming model is formulated to minimize the expected value of the route length of container transshipping flows in the yard. Moreover, a heuristic algorithm is developed for solving the problem in large-scale realistic environments. Numerical experiments are conducted to prove the necessity of the proposed model and also validate the efficiency of the proposed algorithm.
منابع مشابه
Berth management in container terminal
One of the foremost planning problems in container transshipment operation concerns the allocation of home berth (preferred berthing location) to a set of vessels scheduled to call at the terminal on a weekly basis. The home berth location is subsequently used as a key input to yard storage, personnel, and equipment deployment planning. For instance, the yard planners use the home berth templat...
متن کاملارائه یک روش ابتکاری ترکیبی مبتنی بر الگوریتم ژنتیک برای حل مسأله هاب پوششی در حالت فازی
Hub location problem is one of the new issues in location problems. This kind of location problem is widely used in many transportation and telecommunication networks. Hubs are facilities that serve as transshipment and switching point to consolidate flows at certain locations for transportation,airline and postal systems so they are vital elements of such these networks. The location and numb...
متن کاملThe tree-of-hubs location problem: A comparison of formulations
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportation systems in which (i) several locations send and receive a product, and (ii) the performance can be improved by using transshipment points (hubs) where the product is collected and distributed. We want to locate a fi...
متن کاملDevelopment of a Model for Locating Hubs in a Competitive Environment under Uncertainty: A Robust Optimization Approach
This article explores the development of previous models to determine hubs in a competitive environment. In this paper, by comparing parameters of the ticket price, travel time and the service quality of hub airports, airline hubs are divided into six categories. The degree of importance of travel time and travel cost are determined by a multivariate Lagrange interpolation method, which can pla...
متن کاملNew bounds and algorithms for the transshipment yard scheduling problem
In a modern rail–rail transshipment yard huge gantry cranes transship containers between different freight trains, so that hub-and-spoke railway systems are enabled. In this context, we consider the transshipment yard scheduling problem (TYSP) where trains have to be assigned to bundles, which jointly enter and leave the yard. The objective is to minimize split moves and revisits. Split moves a...
متن کامل